Description: 这是一个好的建模学习资料,赶快下载吧,
数学建模十大算法 ( 包含:蒙特卡罗算法、数据拟合、参数估计、
插值等数据处理算法、线性规划、整数规划、多元规划、二次规划等规划类问题、
图论算法、动态规划、回溯搜索、分治算法、分支定界等计算机算法、
最优化理论的三大非经典算法：模拟退火法、神经网络、遗传算法、
网格算法和穷举法、一些连续离散化方法、数值分析算法、图象处理算法）-This a good model to study the information, download it quickly, mathematical modeling algorithm 10 (includes : Monte Carlo algorithm, data fitting, parameter estimation, interpolation of data-processing algorithms, linear programming, integer programming, diversity planning, Quadratic Programming category of zoning, graph-theoretical algorithms, dynamic programming, retroactive search, the partition algorithm, branch-and-bound algorithm computer, most optimization theory of the three non-classical algorithm : simulated annealing, neural networks, genetic algorithms, mesh algorithms and exhaustive, some consecutive discrete method, numerical analysis algorithms, image processing algorithm) Platform: |
Size: 5928960 |
Author:zhxj |
Hits:
Description: 求解货郎担问题的分枝限界算法,程序中有较为详细的注释-solving the traveling salesman problem Branch and Bound algorithm, procedures are more detailed Notes Platform: |
Size: 3072 |
Author:郎风华 |
Hits:
Description: 搜索算法——包含回溯法、分枝定界和贪心法-Search algorithm- includes backtracking, branch and bound and the greedy method Platform: |
Size: 6144 |
Author:chen |
Hits:
Description: 对于给顶的仓库局,以及仓库管理员在仓库中的位置和箱子的开始位置和目标位置,设计一个解推箱子问题的分支限界法,计算出仓库管理员将箱子从开始位置推到目标位置所需的最少推动次数.-To the top of the warehouse for the Board, as well as the warehouse manager in the warehouse location and the beginning of the box location and target location, the design of a solution of the problem Sokoban branch and bound method to calculate the storage administrator will be the location of boxes from the beginning to the target location the minimum number required to promote. Platform: |
Size: 2048 |
Author:李靖平 |
Hits:
Description: 用分枝界限法找图的最短路径，并显示结果。-With branch-and-bound method to find the shortest path map, and the result will be displayed. Platform: |
Size: 2048 |
Author:莫海波 |
Hits:
Description: 用分支限界法求解背包问题（0/1背包）
1.问题描述：已知有N个物品和一个可以容纳TOT重量的背包，每种物品I的重量为Weight，价值为Value。一个只能全放入或者不放入，求解如何放入物品，可以使背包里的物品的总价值最大。
2.设计思想与分析：对物品的选取与否构成一棵解树，左子树表示装入，右表示不装入，通过检索问题的解树得出最优解，并用结点上界杀死不符合要求的结点。-Using branch and bound method to solve knapsack problem (0/1 knapsack) 1. Problem Description: known to have N of items and a TOT can accommodate the weight of backpacks, the weight of each item I for Weight, the value of Value. Add a can or not Add-wide, to solve how to Add items, the backpack can make the total value of the largest items. 2. The design and analysis: the selection of items or not constitute a solution tree, into the left subtree said, indicated that he did not load right, through the solution search tree reached the optimal solution, and the upper bound of node to kill refuses to comply with the requirements of nodes. Platform: |
Size: 1024 |
Author:黄勇 |
Hits:
Description: 0-1背包问题的分支限界算法实现，有详细的函数功能说明
-0-1 knapsack problem branch and bound algorithm, a detailed description of the function function Platform: |
Size: 2048 |
Author:古月 |
Hits:
Description: 用分支定界法求解旅行商问题旅行商问题是一个经典NP问题：有n个城市，一个推销员要从其中的某一个城市出发，每个城市只能遍历一次，要求走遍所有的城市，再回到他出发的城市，求所有可能路径中路径最短的一条路径来。-Using branch and bound method for solving traveling salesman problem traveling salesman problem is a classic NP problem: have n cities, a salesman from one of a city of departure, each city can only traverse once traveled all the requirements of the City , and then returned to his starting city, and all the possible path of the shortest path to a path. Platform: |
Size: 4096 |
Author:bianbian |
Hits:
Search - branch and bound